Pansharpening of multispectral images using a TV-based super-resolution algorithm Javier Mateos1 , Miguel Vega1 , Rafael Molina1 and Aggelos K. Katsaggelos2 1 2

Source URL: decsai.ugr.es

• Mathematical analysis
• Differential forms
• Mathematics
• Closed and exact differential forms
• Lemmas
• Operator theory
• Partial differential equations
• Connection
• Differential forms on a Riemann surface

Tearing systems of nonlinear equations II.I A practical exact algorithm Ali Bahareva,∗, Hermann Schichla , Arnold Neumaiera a Fakult¨ at

Source URL: www.mat.univie.ac.at

Fine-Grained Complexity and Algorithm Design Boot Camp Recent Advances in FPT and Exact Algorithms for NP-Complete Problems Dániel Marx Institute for Computer Science and Control,

Source URL: www.cs.bme.hu

Physics without Laws - Making exact Predictions with data based Methods

Source URL: reglos.de

• Fractals
• Iterated function
• Operations research
• Artificial neural network
• Mathematical optimization
• Numerical analysis
• Pi
• Tiny Encryption Algorithm

JMLR: Workshop and Conference Proceedings vol–21 Randomized partition trees for exact nearest neighbor search Sanjoy Dasgupta

Source URL: jmlr.org

• Search algorithms
• Nearest neighbor search
• K-d tree
• K-nearest neighbors algorithm
• Locality-sensitive hashing
• R-tree
• Cover tree
• Expected value

Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm? Francisco Claude1 , Reza Dorrigiv1 , Stephane Durocher2 , Robert Fraser1 , Alejandro L´ opez-Ortiz1 ?? , and Alejandro Salinger1 1

Source URL: www.cs.umanitoba.ca

Fine-Grained Complexity and Algorithm Design Boot Camp Recent Advances in FPT and Exact Algorithms for NP-Complete Problems Dániel Marx Institute for Computer Science and Control,

Source URL: www.cs.bme.hu

SIAM J. COMPUT. Vol. 43, No. 1, pp. 312–336 c 2014 Society for Industrial and Applied Mathematics 

Source URL: theory.stanford.edu

• Computational complexity theory
• Operations research
• Complexity classes
• Polynomial-time approximation scheme
• Mechanism design
• Optimization problem
• Approximation algorithm
• Time complexity
• Mathematical optimization
• Exact algorithm
• Single-parameter utility
• Perturbation theory

BRICS RSB. A. Madsen: An Algorithm for Exact Satisfiability Analysed with the Number of Clauses as Parameter BRICS Basic Research in Computer Science

Source URL: www.brics.dk

BRICS DS-04-5 B. Skjernaa: Exact Algorithms for Variants of Satisfiability and Colouring Problems BRICS Basic Research in Computer Science

Source URL: www.brics.dk

• NP-complete problems
• Boolean satisfiability problem
• NP-complete
• Satisfiability
• Maximum cut
• Algorithm
• Graph coloring
• 2-satisfiability
• Theoretical computer science
• Mathematics
• Applied mathematics